Computational complexity theory - PDFSEARCH.IO - Document Search Engine

Computational complexity theory
Results: 2049

#	Item
481	LNCSThe Lost Continent of Polynomial Time: Preprocessing and Kernelization Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-14 09:25:39 Analysis of algorithms Complexity classes Parameterized complexity Kernelization NP-complete problems Time complexity PP Polynomial NP Theoretical computer science Computational complexity theory Applied mathematics
482	Algorithms Lecture thesection: Approximation Algorithms [Fa’13] Le mieux est l’ennemi du bien. [The best is the enemy of the good.] — Voltaire, La Bégueule (1772) Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:03:25 NP-complete problems Approximation algorithm Vertex cover Travelling salesman problem Graph coloring Metric k-center Dynamic programming Christofides algorithm Set cover problem Theoretical computer science Mathematics Computational complexity theory
483	informs MATHEMATICS OF OPERATIONS RESEARCH Vol. 00, No. 0, Xxxxxx 20xx, pp. xxx–xxx ISSN 0364-765X \| EISSN \|xx\|0000\|0xxx Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-09-10 09:13:15 Operations research Submodular set function Computational complexity theory Linear programming Randomized rounding Continuous function Optimization problem Mathematical optimization Time complexity Theoretical computer science Mathematics Applied mathematics
484	Fast Randomized Test-and-Set and Renaming Dan Alistarh1 , Hagit Attiya1,2 , Seth Gilbert1 , Andrei Giurgiu1 , and Rachid Guerraoui1 1 Ecole Polytechnique F´ed´erale de Lausanne, Lausanne, Switzerland 2 Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2011-11-17 23:45:01 Analysis of algorithms Computational complexity theory Probabilistic complexity theory Randomized algorithm Algorithm Complexity Consensus Adversary model In-place algorithm Theoretical computer science Applied mathematics Mathematics
485	Some Complexities in Computer-Based Systems and Their Implications for System Development Michael Jackson 101 Hamilton Terrace London NW8 9QX + Add to Reading List Source URL: mcs.open.ac.uk Language: English - Date: 2002-05-03 12:56:50 Object-oriented programming Application programming interfaces Abstraction Data management X Window System Class Complexity Function Computational complexity theory Software engineering Computing Software
486	Exact and Approximate Probabilistic Symbolic Execution for Nondeterministic Programs Kasper S. Luckow ˘ areanu ˘ Add to Reading List Source URL: www.cs.sun.ac.za Language: English - Date: 2014-09-18 09:08:01 Complexity classes Probabilistic complexity theory Analysis of algorithms Randomized algorithm NL PP Algorithm Monte Carlo method Scheduling Theoretical computer science Computational complexity theory Applied mathematics
487	CS 373: Combinatorial Algorithms, Fall 2000 Homework 6 (due December 7, 2000 at midnight) Name: Net ID: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:48:14 NP-complete problems Complexity classes NP-complete NP-hard NP Maximum cut Shortest path problem Travelling salesman problem P-complete Theoretical computer science Computational complexity theory Mathematics
488	CS 373: Combinatorial Algorithms, Spring 2001 http://www-courses.cs.uiuc.edu/~cs373 Homework 6 (due Tue. May 1, 2001 at 11:59.99 p.m.) Name: Net ID: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:52:35 NP-complete problems Complexity classes NP-complete NP-hard NP Travelling salesman problem Vertex cover Maximum cut Shortest path problem Theoretical computer science Computational complexity theory Mathematics
489	A Casual Tour Around a Circuit Complexity Bound∗ arXiv:1111.1261v1 [cs.CC] 4 Nov 2011 Ryan Williams† Add to Reading List Source URL: arxiv.org Language: English - Date: 2011-11-07 20:15:16 Complexity classes NTIME Circuit complexity P Bounded-error probabilistic polynomial Cook–Levin theorem Time hierarchy theorem NEXPTIME Time complexity Theoretical computer science Computational complexity theory Applied mathematics
490	16 CHAPTER 2. LEADER ELECTION of each node has the same structure. We will now show that non-uniform anonymous leader election for synchronous rings is impossible. The idea is that Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:48 Distributed data storage Analysis of algorithms Probabilistic complexity theory Randomized algorithm Distributed algorithm Graph coloring Leader election Distributed computing Consensus Theoretical computer science Mathematics Computational complexity theory

UPDATE